Applications of Craig Interpolants in Model Checking
نویسنده
چکیده
A Craig interpolant for a mutually inconsistent pair of formulas (A,B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common variables of A and B. An interpolant can be efficiently derived from a refutation of A ∧ B, for certain theories and proof systems. We will discuss a number of applications of this concept in finiteand infinite-state model checking.
منابع مشابه
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems
ion Refinement with Craig Interpolation and Symbolic Pushdown Systems ? Javier Esparza, Stefan Kiefer, and Stefan Schwoon Institute for Formal Methods in Computer Science, University of Stuttgart {esparza,kiefersn,schwoosn}@informatik.uni-stuttgart.de Abstract. Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model-checking. In this paper, we ...
متن کاملLeveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quality of approximations and consequently the performance of the model checkers. Recently, it was observed that for the same resolution proof a complete lattice of interpolants ordered by strength can be derived. Most stat...
متن کاملEfficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining proofs of unsatisfiability and interpolants for conjunctions of line...
متن کاملPeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
Propositional interpolation is widely used as a means of overapproximation to achieve efficient SAT-based symbolic model checking. Different verification applications exploit interpolants for different purposes; it is unlikely that a single interpolation procedure could provide interpolants fit for all cases. This paper describes the PeRIPLO framework, an interpolating SAT-solver that implement...
متن کاملGeneralized Craig Interpolation for Stochastic Boolean Satisfiability Problems
The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, among them bounded model checking (BMC) of symbolically represented Markov decision processes. This paper identifies a notion of Craig interpolant for the ...
متن کامل